A squeaky wheel optimisation methodology for two-dimensional strip packing

نویسندگان

  • Edmund K. Burke
  • Matthew R. Hyde
  • Graham Kendall
چکیده

The two dimensional strip packing problem occurs in industries such as metal, wood, glass, paper, and textiles. The problem involves cutting shapes from a larger stock sheet or roll of material, while minimising waste. This is a well studied problem for which many heuristic methodologies are available in the literature, ranging from the basic ‘one-pass’ best-fit heuristic, to the state of the art Reactive GRASP and SVC(SubKP) iterative procedures. The contribution of this paper is to present a much simpler but equally competitive iterative packing methodology based on squeaky wheel optimisation. After each complete packing (iteration), a penalty is applied to pieces that directly decreased the solution quality. These penalties inform the packing in the next iteration, so that the offending pieces are packed earlier. This methodology is deterministic and very easy to implement, and can obtain some best results on benchmark instances from the literature.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Evolutionary Squeaky Wheel Optimisation Approach to Personnel Scheduling

The quest for robust heuristics that are able to solve more than one problem is ongoing. In this paper, we present, discuss and analyse a technique called Evolutionary Squeaky Wheel Optimisation and apply it to two different personnel scheduling problems. Evolutionary Squeaky Wheel Optimisation improves the original Squeaky Wheel Optimisation’s effectiveness and execution speed by incorporating...

متن کامل

A Comparative Study of Exact Algorithms for the Two Dimensional Strip Packing Problem

In this paper we consider a two dimensional strip packing problem. The problem consists of packing a set of rectangular items in one strip of width W and infinite height. They must be packed without overlapping, parallel to the edge of the strip and we assume that the items are oriented, i.e. they cannot be rotated. To solve this problem, we use three exact methods: a branch and bound method, a...

متن کامل

Improved Squeaky Wheel Optimisation for Driver Scheduling

This paper presents a technique called Improved Squeaky Wheel Optimisation (ISWO) for driver scheduling problems. It improves the original Squeaky Wheel Optimisation’s (SWO) effectiveness and execution speed by incorporating two additional steps of Selection and Mutation which implement evolution within a single solution. In the ISWO, a cycle of Analysis-SelectionMutation-Prioritization-Constru...

متن کامل

Bidirectional best-fit heuristic considering compound placement for two dimensional orthogonal rectangular strip packing

The two dimensional orthogonal rectangular strip packing problem is a common NPhard optimisation problem whereby a set of rectangular shapes must be placed on a fixed width stock sheet with infinite length in such a way that wastage is minimised and material utilisation is maximised. The bidirectional best-fit heuristic is a deterministic approach which has previously been shown to outperform e...

متن کامل

Symmetry breaking generalized disjunctive formulation for the strip packing problem

The two-dimensional strip packing is a special case of “Cutting and Packing” problems that arises in many applications. The problem seeks to pack a given set of rectangles into a strip of given width in order to minimize its length. Some applications in which the strip packing problem arises are: Cutting pieces from wooden boards, cutting pieces from glass or steel sheets, optimal layout of ind...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computers & OR

دوره 38  شماره 

صفحات  -

تاریخ انتشار 2011